Convergence Rate of Least Square Regressions with Data Dependent Hypothesis
نویسندگان
چکیده
منابع مشابه
Least Square Regression Learning with Data Dependent Hypothesis and Coefficient Regularzation
-We study the least square regression with data dependent hypothesis and coefficient regularization algorithms based on general kernel. An explicit expression of the solution of this kernel scheme is derived. Then we provide a sample error with a decay of 1 ( ) O m and estimate the approximation error in terms of some kind of K -functional. Index Terms -Least Square Regressions, Data Dependent ...
متن کاملMean square convergence analysis for kernel least mean square algorithm
In this paper, we study the mean square convergence of the kernel least mean square (KLMS). The fundamental energy conservation relation has been established in feature space. Starting from the energy conservation relation, we carry out the mean square convergence analysis and obtain several important theoretical results, including an upper bound on step size that guarantees the mean square con...
متن کاملConvergence Analysis of Proportionate-type Least Mean Square Algorithms
In this paper, we present the convergence analysis of proportionate-type least mean square (Pt-LMS) algorithm that identifies the sparse system effectively and more suitable for real time VLSI applications. Both first and second order convergence analysis of Pt-LMS algorithm is studied. Optimum convergence behavior of Pt-LMS algorithm is studied from the second order convergence analysis provid...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملRegularized Least Square Regression with Unbounded and Dependent Sampling
and Applied Analysis 3 Theorem 4. Suppose that the unbounded hypothesis with p > 2 holds, L−r K f ρ ∈ L 2 ρX (X) for some r > 0, and theα-mixing coefficients satisfy a polynomial decay, that is, α l ≤ bl −t for some b > 0 and t > 0. Then, for any 0 < η < 1, one has with confidence 1 − η, fz,γ − ρ ρX = O(m −θmin{(p−2)t/p,1} (logm)1/2) , (13) where θ is given by θ = { { { { { {...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2014
ISSN: 1812-5638
DOI: 10.3923/itj.2014.1257.1261